Non-differentiable multiobjective mixed symmetric duality under generalized convexity
نویسندگان
چکیده
* Correspondence: lijueyou@163. com Department of Mathematics, Chongqing Normal University, Chongqing, 400047, PR China Abstract The objective of this paper is to obtain a mixed symmetric dual model for a class of non-differentiable multiobjective nonlinear programming problems where each of the objective functions contains a pair of support functions. Weak, strong and converse duality theorems are established for the model under some suitable assumptions of generalized convexity. Several special cases are also obtained. MS Classification: 90C32; 90C46.
منابع مشابه
Mixed symmetric duality in non-differentiable multiobjective mathematical programming
Two mixed symmetric dual models for a class of non-differentiable multiobjective nonlinear programming problems with multiple arguments are introduced in this paper. These two mixed symmetric dual models unify the four existing multiobjective symmetric dual models in the literature. Weak and strong duality theorems are established for these models under some mild assumptions of generalized conv...
متن کاملMultiobjective Mixed Symmetric Duality with Invexity
The usual duality results are established for mixed symmetric multiobjective dual programs without nonnegativity constraints using the notion of invexity/ generalized invexity which has allowed weakening various types of convexity/ generalized convexity assumptions. This mixed symmetric dual formulation unifies two existing symmetric dual formulations in the literature.
متن کاملSecond Order Mixed Symmetric Duality in Non-differentiable Multi-objective Mathematical Programming
A pair of Mond-Weir type second order mixed symmetric duals is presented for a class of non-differentiable multi-objective nonlinear programming problems with multiple arguments. We establish duality theorems for the new pair of dual models under second order generalized convexity assumptions. This mixed second order dual formulation unifies the two existing second order symmetric dual formulat...
متن کاملHigher-order symmetric duality for a class of multiobjective fractional programming problems
Correspondence: gaoyingimu@163. com Department of Mathematics, Chongqing Normal University, Chongqing 400047, China Abstract In this paper, a pair of nondifferentiable multiobjective fractional programming problems is formulated. For a differentiable function, we introduce the definition of higher-order (F, a, r, d)-convexity, which extends some kinds of generalized convexity, such as second or...
متن کاملMinimax mixed integer symmetric duality for multiobjective variational problems
A Mond–Weir type multiobjective variational mixed integer symmetric dual program over arbitrary cones is formulated. Applying the separability and generalized F-convexity on the functions involved, weak, strong and converse duality theorems are established. Self duality theorem is proved. A close relationship between these variational problems and static symmetric dual minimax mixed integer mul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011